A Multiresolution Approach for Shape from Shading Coupling Deterministic and Stochastic Optimization
نویسندگان
چکیده
Shape from shading is an ill-posed inverse problem for which there is no completely satisfactory solution in the existing literature. In this paper, we address shape from shading as an energy minimization problem. We first show that the deterministic approach provides efficient algorithms in terms of CPU time, but reaches its limits since the energy associated with shape from shading can contain multiple deep local minima. We derive an alternative stochastic approach using simulated annealing. The obtained results strongly outperform the results of the deterministic approach. The shortcoming is an extreme slowness of the optimization. Therefore, we propose a hybrid approach which combines the deterministic and stochastic approaches in a multiresolution framework.
منابع مشابه
Project Proposal: A Multiresolution Stochastic Approach for Shape From Shading Using Intensity Gradient Constraint
The objective of this project is the study of Shape from Shading (SfS) problem in a variational framework. Among the other shape recovery methods, SfS is employed to obtain three-dimensional shape using spatial variations of brightness in an image. In this study, SfS problem will be addressed as an energy minimization problem. A constraint which establishes a connection between intensity gradie...
متن کاملA Spatially Multiresolution, Mrf Optimization Based Approach to the Shape from Shading Problem
This paper extends the MRF formulation approach [6] for solving the shape from shading problem. Our method uses simulated annealing Gibbs sampling to minimize a lattice energy for an MRF formulation which characterizes the Shape from Shading (SFS) problem under Lambertian reflectance conditions. We explore a spatial multi-resolution approach which refines the digital elevation map of the surfac...
متن کاملFrom Deterministic to Stochastic Methods for Shape From Shading
Shape from shading designates the problem of shape rebuilding of a surface, starting from one image only of this surface. We compare different iterative methods of resolution of shape from shading. An analysis of the various discrete formulations of the problem is made, which allows the proposition of a certain number of error functions. Three deterministic methods to minimize these errors are ...
متن کاملStochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کاملOptimization of the Inflationary Inventory Control Model under Stochastic Conditions with Simpson Approximation: Particle Swarm Optimization Approach
In this study, we considered an inflationary inventory control model under non-deterministic conditions. We assumed the inflation rate as a normal distribution, with any arbitrary probability density function (pdf). The objective function was to minimize the total discount cost of the inventory system. We used two methods to solve this problem. One was the classic numerical approach which turne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Pattern Anal. Mach. Intell.
دوره 25 شماره
صفحات -
تاریخ انتشار 2003